On the Expected Size of Recursive Datalog Queries
نویسندگان
چکیده
منابع مشابه
The Subtree Size Profile of Bucket Recursive Trees
Kazemi (2014) introduced a new version of bucket recursive trees as another generalization of recursive trees where buckets have variable capacities. In this paper, we get the $p$-th factorial moments of the random variable $S_{n,1}$ which counts the number of subtrees size-1 profile (leaves) and show a phase change of this random variable. These can be obtained by solving a first order partial...
متن کاملDatalog and Recursive Query Processing
In recent years, we have witnessed a revival of the use of recursivequeries in a variety of emerging application domains such as data in-tegration and exchange, information extraction, networking, and pro-gram analysis. A popular language used for expressing these queries isDatalog. This paper surveys for a general audience the Datalog lan-guage, recursive query processing, ...
متن کاملGames and total Datalog¬ queries
We show that the expressive power of Datalog : programs under the well-founded semantics does not decrease when restricted to total programs thereby aarmatively answering an open question posed by Abiteboul, Hull, and Vianu AHV95]. In particular , we show that for every such program there exists an equivalent total program whose only recursive rule is of the form win(X) move(X; Y); :win(Y) wher...
متن کاملsurvey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولConcurrent Smart Evaluation of Datalog Queries
A substantial effort has been made in the development of efficient algorithms for (both sequent ial and parallel) Datalog program evaluation. In this paper we discuss a Dataflow evaluation model and we show how standard algorithms for the bottom-up evaluation of Datalog queries can be significantly improved by means of enhancing the concurrency degree with a concurrent Dataflow evaluation model...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1995
ISSN: 0022-0000
DOI: 10.1006/jcss.1995.1057